Coupling Hoist Scheduling and Production Line Arrangement for Productivity Maximization

نویسندگان

  • Chuanyu Zhao
  • Qiang Xu
  • Dan F. Smith
چکیده

Hoist scheduling is an important element for productivity maximization in multi-stage material handling processes, especially in electroplating system. However, the productivity of a multi-stage process not only depends on the hoist schedule, but also substantially relies on the production line arrangement, i.e., the design for spatial allocations of various processing units. In this paper, an MILP model has been developed to couple cyclic hoist scheduling and production line arrangement for global maximum of productivity. The efficacy of the proposed methodology is demonstrated by a virtual case study. The in-depth analysis for hoist scheduling with and without consideration of production line arrangement has also been provided.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three-tank hoist scheduling problem with unbounded or zero-width processing windows

On surface treatment lines, the products are transferred in successive tanks by a hoist. Moreover, each processing time is nested between a minimal and a maximal duration. This constraint is called the processing window constraint. An interesting problem is to find the hoist moves which maximise productivity. This paper deals with the production of identical parts in a balanced three-tank line....

متن کامل

A Multihoist Model for the Real Time Hoist Scheduling Problem

This paper presents a real time approach for optimizing the production rate of a line in the field of multiproduct Hoist Scheduling Problem (scheduling of the moves of a hoist in electroplating facilities). As a real time context is considered, any time a new job arrives, a new schedule of the whole jobs has to be computed. This local problem is referred as the Dynamic Hoist Scheduling Problem ...

متن کامل

Resolution of graphs with Bounded Cycle Time for the Cyclic Hoist Scheduling Problem

We deal with the Hoist Scheduling Problem, where a hoist carrying products along a production line must be scheduled. Products are taken from a bath once finished an operation and moved to the following one. There are time windows (a minimum and a maximum values) for the time spend at each treatment. The objective is to minimise the total production time. Our contribution is the use of bounds o...

متن کامل

A genetic algorithm approach for a single hoist scheduling problem with time windows constraints

This study considers a cyclic scheduling of hoist movements in electroplating industry. Several jobs have to flow through a production line according to an ordered bath sequence. They firstly enter the line at a loading buffer. Then they will be soaked sequentially in a series of tanks containing specific chemical baths. Finally, they will leave the line at the unloading buffer. The processing ...

متن کامل

Single hoist cyclic scheduling with multiple tanks: a material handling solution

A hoist controlled by a computer is widely used for moving electroplates which is chemically treated in a sequence of tanks. The hoist scheduling directly a.ects the throughput of a production system. The objective of the hoist scheduling problem is to schedule the moves to maximize the throughput. This paper investigates the hoist scheduling problem, a speci2c material handling issue, in a man...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011